Eigenvector-based Dimensionality Reduction for Human Activity Recognition and Data Classification

In the context of appearance-based human motion compression, representation, and recognition, we have proposed a robust framework based on the eigenspace technique. First, the new appearance-based template matching approach which we named Motion Intensity Image for compressing a human motion video into a simple and concise, yet very expressive representation. Second, a learning strategy based on the eigenspace technique is employed for dimensionality reduction using each of PCA and FDA, while providing maximum data variance and maximum class separability, respectively. Third, a new compound eigenspace is introduced for multiple directed motion recognition that takes care also of the possible changes in scale. This method extracts two more features that are used to control the recognition process. A similarity measure, based on Euclidean distance, has been employed for matching dimensionally-reduced testing templates against a projected set of known motions templates. In the stream of nonlinear classification, we have introduced a new eigenvector-based recognition model, built upon the idea of the kernel technique. A practical study on the use of the kernel technique with 18 different functions has been carried out. We have shown in this study how crucial choosing the right kernel function is, for the success of the subsequent linear discrimination in the feature space for a particular problem. Second, building upon the theory of reproducing kernels, we have proposed a new robust nonparametric discriminant analysis approach with kernels. Our proposed technique can efficiently find a nonparametric kernel representation where linear discriminants can perform better. Data classification is achieved by integrating the linear version of the NDA with the kernel mapping. Based on the kernel trick, we have provided a new formulation for Fisher\u27s criterion, defined in terms of the Gram matrix only

Inference in distributed multiagent reasoning systems in cooperation with artificial neural networks

This research is motivated by the need to support inference in intelligent decision support systems offered by multi-agent, distributed intelligent systems involving uncertainty. Probabilistic reasoning with graphical models, known as Bayesian networks (BN) or belief networks, has become an active field of research and practice in artificial intelligence, operations research, and statistics in the last two decades. At present, a BN is used primarily as a stand-alone system. In case of a large problem scope, the large network slows down inference process and is difficult to review or revise. When the problem itself is distributed, domain knowledge and evidence has to be centralized and unified before a single BN can be created for the problem. Alternatively, separate BNs describing related subdomains or different aspects of the same domain may be created, but it is difficult to combine them for problem solving, even if the interdependency relations are available. This issue has been investigated in several works, including most notably Multiply Sectioned BNs (MSBNs) by Xiang [Xiang93]. MSBNs provide a highly modular and efficient framework for uncertain reasoning in multi-agent distributed systems. Inspired by the success of BNs under the centralized and single-agent paradigm, a MSBN representation formalism under the distributed and multi-agent paradigm has been developed. This framework allows the distributed representation of uncertain knowledge on a large and complex environment to be embedded in multiple cooperative agents and effective, exact, and distributed probabilistic inference. What a Bayesian network is, how inference can be done in a Bayesian network under the single-agent paradigm, how multiple agents’ diverse knowledge on a complex environment can be structured as a set of coherent probabilistic graphical models, how these models can be transformed into graphical structures that support message passing, and how message passing can be performed to accomplish tasks in model compilation and distributed inference are covered in details in this thesis